Classification of the Congruent Embeddings of a Tetrahedron into a Triangular Prism
نویسندگان
چکیده
Let P(t) denote an infinitely long right triangular prism whose base is an equilateral triangle of edge length t. Let F (t) be the family of those subsets of P(t) that are congruent to a regular tetrahedron of unit edge. We present complete classification of the members of F (t) modulo rigid motions within the prism P(t), for every t > 0.
منابع مشابه
Tetrahedra Passing through a Triangular Hole
We prove an embedding theorem that says a convex body can pass through a triangular hole∆ if and only if the convex body can be congruently embedded in a right triangular prism with base ∆. Combining this with a known result on congruent embeddings of a regular tetrahedron in a triangular prism, we show that a regular tetrahedron with unit edge can pass through an equilateral triangular hole in...
متن کاملOn Convex Surfaces with Minimal Moment of Inertia
We investigate the problem of minimizing the moment of inertia among convex surfaces in R having a specified surface area. First we prove a minimizing surface exists, and derive a necessary condition holding at points of positive curvature. Then we show that an equilateral triangular prism is the optimal triangular prism, that the cube is the optimal rectangular prism, and that the sphere is (l...
متن کاملA Regular Tetrahedron Passes through a Hole Smaller than Its Face
We prove that no triangular frame can hold a convex body, and a convex body can pass through a triangular hole ∆ if and only if the convex body can be congruently embedded in a right triangular prism with base ∆. Applying these result, we prove that a regular tetrahedron of unit edge can pass through an equilateral triangular hole if and only if the edge length of the hole is at least (1 + √ 2)...
متن کاملConstant-Time Neighbor Finding in Hierarchical Tetrahedral Meshes
Techniques are presented for moving between adjacent tetrahedra in a tetrahedral mesh. The tetrahedra result from a recursive decomposition of a cube into six initial congruent tetrahedra. A new technique is presented fo r labeling the triangular faces. The labeling enables the implementation of a binary-like decomposition of each tetrahedron which is represented using a pointerless representat...
متن کاملTriangular embeddings of complete graphs
In this paper we describe the generation of all nonorientable triangular embeddings of the complete graphs K12 and K13. (The 59 nonisomorphic orientable triangular embeddings of K12 were found in 1996 by Altshuler, Bokowski and Schuchert, and K13 has no orientable triangular embeddings.) There are 182, 200 nonisomorphic nonorientable triangular embeddings for K12, and 243, 088, 286 for K13. Tri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 27 شماره
صفحات -
تاریخ انتشار 2011